A Constructive Induction of Feature using Random Forest Approach
نویسندگان
چکیده
منابع مشابه
Constructive Induction Using a Non-Greedy Strategy for Feature Selection
We present a method for feature construction and selection that finds a minimal set of conjunctive features that are appropriate to perform the classification task. For problems where this bias is appropriate, the method outperforms other constructive induction algorithms and is able to achieve higher classification accuracy. The application of the method in the search for minimal multi-level b...
متن کاملDiagnosis of Diabetes Using a Random Forest Algorithm
Background: Diabetes is the fourth leading cause of death in the world. And because so many people around the world have the disease, or are at risk for it, diabetes can be called the disease of the century. Diabetes has devastating effects on the health of people in the community and if diagnosed late, it can cause irreparable damage to vision, kidneys, heart, arteries and so on. Therefore, it...
متن کاملFeature-Budgeted Random Forest
We seek decision rules for prediction-time cost reduction, where complete data is available for training, but during prediction-time, each feature can only be acquired for an additional cost. We propose a novel random forest algorithm to minimize prediction error for a user-specified average feature acquisition budget. While random forests yield strong generalization performance, they do not ex...
متن کاملInterpreting Random Forest Classification Models Using a Feature Contribution Method
Model interpretation is one of the key aspects of the model evaluation process. The explanation of the relationship between model variables and outputs is relatively easy for statistical models, such as linear regressions, thanks to the availability of model parameters and their statistical significance. For “black box” models, such as random forest, this information is hidden inside the model ...
متن کاملConstructive Induction: A Version Space-based Approach
By automatically reformulating the problem domain, constructive induction ideally overcomes the defects of the ini t ial description. The reformulation presented here uses the Version Space primitives D ( E , F ) , defined for any pair of examples E and F, as the set of hypotheses covering E and discriminating F, From these primitives we derive a polynomial number of M-of -N concept. Experiment...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2020
ISSN: 1877-0509
DOI: 10.1016/j.procs.2020.09.066